51 research outputs found
Survey on the Tukey theory of ultrafilters
This article surveys results regarding the Tukey theory of ultrafilters on
countable base sets. The driving forces for this investigation are Isbell's
Problem and the question of how closely related the Rudin-Keisler and Tukey
reducibilities are. We review work on the possible structures of cofinal types
and conditions which guarantee that an ultrafilter is below the Tukey maximum.
The known canonical forms for cofinal maps on ultrafilters are reviewed, as
well as their applications to finding which structures embed into the Tukey
types of ultrafilters. With the addition of some Ramsey theory, fine analyses
of the structures at the bottom of the Tukey hierarchy are made.Comment: 25 page
The Ramsey Theory of Henson graphs
Analogues of Ramsey's Theorem for infinite structures such as the rationals
or the Rado graph have been known for some time. In this context, one looks for
optimal bounds, called degrees, for the number of colors in an isomorphic
substructure rather than one color, as that is often impossible. Such theorems
for Henson graphs however remained elusive, due to lack of techniques for
handling forbidden cliques. Building on the author's recent result for the
triangle-free Henson graph, we prove that for each , the
-clique-free Henson graph has finite big Ramsey degrees, the appropriate
analogue of Ramsey's Theorem.
We develop a method for coding copies of Henson graphs into a new class of
trees, called strong coding trees, and prove Ramsey theorems for these trees
which are applied to deduce finite big Ramsey degrees. The approach here
provides a general methodology opening further study of big Ramsey degrees for
ultrahomogeneous structures. The results have bearing on topological dynamics
via work of Kechris, Pestov, and Todorcevic and of Zucker.Comment: 75 pages. Substantial revisions in the presentation. Submitte
- …